Symbolic Program Analysis in Almost-Linear Time
نویسندگان
چکیده
منابع مشابه
Conference Record of the Fifth Annual Acm Symposium on Principles of Programming Language? Abstract Symbolic Program Analysis in Almost Linear Time
SYMBOLIC PROGRAM ANALYSIS IN ALMOST LINEAR TIME John H. Reif Department of Computer Science The University of Rochester A global flow model is assumed; as usual, the flow of control is represented by a digraph called the control flow graph. The objective of our program analysis is the construction of a mapping (a cover) from program text expressions to symbolic expressions for their value holdi...
متن کاملOn the Sensitivity Analysis of Analog Circuits
The paper presents three procedures for the sensitivity analysis using auxiliary circuits: the Bykhovsky Perkins Cruz’s method, the incrementalcircuit approach and the adjoint-circuit approach. All methods, based on the auxiliary circuits, have needed an efficient partially-symbolic method for the circuit analysis. For this, it was elaborated a very good procedure for the partially-symbolic ana...
متن کاملAutomatic Inference of Access Permissions
Access permissions are used in several program verification approaches such as those based on separation logic or implicit dynamic frames to simplify framing and to provide a basis for reasoning about concurrent code. However, access permissions increase the annotation overhead because programmers need to specify for each program component which permissions it requires or provides. We present a...
متن کاملConstruction of Thinned Gated Single-Assignment Form
Analysis of symbolic expressions beneets from a suitable program representation. We show how to build thinned gated single-assignment (TGSA) form, a value-oriented program representation which is more complete than standard SSA form, deened on all reducible programs , and better for representing symbolic expressions than program dependence graphs or original GSA form. We present practical algor...
متن کاملSymbolic Computation of the Worst-Case Execution Time of a Program
Parametric Worst-case execution time (WCET) analysis of a sequential program produces a formula that represents the worst-case execution time of the program, where parameters of the formula are user-defined parameters of the program (as loop bounds, values of inputs or internal variables, etc). In this paper we propose a novel methodology to compute the parametric WCET of a program. Unlike othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 11 شماره
صفحات -
تاریخ انتشار 1982